<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    64. Minimum Path Sum
   </h1>
   <p>
    Given a
    <em>
     m
    </em>
    x
    <em>
     n
    </em>
    grid filled with non-negative numbers, find a path from top left to bottom right which
    <em>
     minimizes
    </em>
    the sum of all numbers along its path.
   </p>
   <p>
    <strong>
     Note:
    </strong>
    You can only move either down or right at any point in time.
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <pre>
<strong>Input:</strong>
[
&nbsp; [1,3,1],
  [1,5,1],
  [4,2,1]
]
<strong>Output:</strong> 7
<strong>Explanation:</strong> Because the path 1&rarr;3&rarr;1&rarr;1&rarr;1 minimizes the sum.
</pre>
  </div>
  <div>
   <h1 class="question_title">
    64. 最小路径和
   </h1>
   <p>
    给定一个包含非负整数的
    <em>
     m
    </em>
    &nbsp;x&nbsp;
    <em>
     n
    </em>
    &nbsp;网格，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。
   </p>
   <p>
    <strong>
     说明：
    </strong>
    每次只能向下或者向右移动一步。
   </p>
   <p>
    <strong>
     示例:
    </strong>
   </p>
   <pre><strong>输入:</strong>
[
&nbsp; [1,3,1],
  [1,5,1],
  [4,2,1]
]
<strong>输出:</strong> 7
<strong>解释:</strong> 因为路径 1&rarr;3&rarr;1&rarr;1&rarr;1 的总和最小。
</pre>
  </div>
 </body>
</html>